Connections between quaternary and boolean bent functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between Quaternary and Binary Bent Functions

Boolean bent functions were introduced by Rothaus (1976) as combinatorial objects related to difference sets, and have since enjoyed a great popularity in symmetric cryptography and low correlation sequence design. In this paper direct links between Boolean bent functions, generalized Boolean bent functions (Schmidt, 2006) and quaternary bent functions (Kumar, Scholtz, Welch, 1985) are explored...

متن کامل

Bent and generalized bent Boolean functions

In this paper, we investigate the properties of generalized bent functions defined on Z2 with values in Zq , where q ≥ 2 is any positive integer. We characterize the class of generalized bent functions symmetric with respect to two variables, provide analogues of Maiorana–McFarland type bent functions and Dillon’s functions in the generalized set up. A class of bent functions called generalized...

متن کامل

Connections between Neural Networks and Boolean Functions∗

This report surveys some connections between Boolean functions and artificial neural networks. The focus is on cases in which the individual neurons are linear threshold neurons, sigmoid neurons, polynomial threshold neurons, or spiking neurons. We explore the relationships between types of artificial neural network and classes of Boolean function. In particular, we investigate the type of Bool...

متن کامل

Generalized Boolean Bent Functions

The notions of perfect nonlinearity and bent functions are closely dependent on the action of the group of translations over IF2 . Extending the idea to more generalized groups of involutions without fixed points gives a larger framework to the previous notions. In this paper we largely develop this concept to define G-perfect nonlinearity and G-bent functions, where G is an Abelian group of in...

متن کامل

Minimum Distance between Bent and Resilient Boolean Functions

The minimum distance between Bent functions and Resilient functions is studied. An algorithm for calculating the minimum distance betw een Bent functions and resilient functions is given. We give a new lower bound for the minimum distance be tween Bent functions and 1 resilient functions. This new lower bound is better than that presented by S. Maity etc in 2004, and their conjectures are prove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Prikladnaya diskretnaya matematika. Prilozhenie

سال: 2019

ISSN: 2226-308X

DOI: 10.17223/2226308x/12/22